Semi-simple radical classes

Semi-θ-Open Sets and New Classes of Maps

Semi-simple splicing systems

In 1987 Tom Head [5] introduced the idea of splicing as a generative mechanism in formal language theory. This mechanism was popularized and extensively developed by Gheorghe Păun and his many coworkers, who recognized much of the subtlety and power of this mechanism and who used it as a foundation for the rapidly developing study of DNA based computing. See, for example, [11] and [12]. (The mo...

Complexity Classes Characterized by Semi-Random Sources

The complexity classes characterized by semirandom sources were investigated. U.V. Vazirani and V.V Vazirani [VV85] showed that 8 -RP = RP, and U.V. Vazirani [Vaz86] showed that 8 -BPP = BPP, where, for the random class C, the class 8 -C is a set of all languages which satisfy the condition for C by using any -random source. First, we show

On Semi/tame Classes of Finite Structures

We modify the definition of robust chains from [25] as an approach to formalizing the Finite Sub-model Property (see [21], for example) from the perspective of a class of finite structures with a generic model (i.e. having the Amalgamation and Joint-embedding properties). We characterize this formulation, which we call super-robustness, modulo a weaker condition (that is closer to the the situa...

Simple Semi-Supervised POS Tagging

We tackle the question: how much supervision is needed to achieve state-of-the-art performance in part-of-speech (POS) tagging, if we leverage lexical representations given by the model of Brown et al. (1992)? It has become a standard practice to use automatically induced “Brown clusters” in place of POS tags. We claim that the underlying sequence model for these clusters is particularly well-s...